منابع مشابه
The Minimum Expectation Selection Problem
We define the min-min expectation selection problem (resp. max-min expectation selection problem) to be that of selecting k out of n given discrete probability distributions, to minimize (resp. maximize) the expectation of the minimum value resulting when independent random variables are drawn from the selected distributions. We assume each distribution has finitely many atoms. Let d be the num...
متن کاملOn the Selection and Assignment Problem with Minimum Quantity Commitments
The thesis studies a new constraint, named minimum quantity commitments, for the selection and assignment problem. It is motivated by the Royal Philips Electronics and a special stipulation of the US Federal Maritime Commission. Our work is expected to initiate the research on this novel constraint for the selection and assignment problem. We first classify all the special cases and prove their...
متن کاملComplexity of the Minimum Input Selection Problem for Structural Controllability
We consider the minimum input selection problem for structural controllability (MISSC), stated as follows: Given a linear system ẋ = Ax, where A is a n × n state matrix with m nonzero entries, find the minimum number of states that need to be driven by an external input so that the resulting system is structurally controllable. The fastest algorithm to solve this problem was recently proposed b...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولA Novel Experimental Analysis of the Minimum Cost Flow Problem
In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2002
ISSN: 1042-9832,1098-2418
DOI: 10.1002/rsa.10061